Dynamical behavior and complexity of Langton's ant

نویسندگان

  • Andrés Moreira
  • Anahí Gajardo
  • Eric Goles Ch.
چکیده

O ne of the first models of artificial life, proposed back in the 1980s by Christopher Langton, founder of the field, was the virtual ant [1,2]. This simple cellular automaton is defined on the square grid in the following way: each square (“cell”) of the grid can be in one of two states, white or black, and the ant is represented by a short arrow that stands on one cell and points to the north, the west, the east, or the south. At each time step, it moves to the cell it was pointing to, and it turns 90 degrees to the left if this cell is white or 90 degrees to the right if it is black; in addition, the state of the cell is switched. Figure 1a shows the situation after 5 time steps, starting with a background of only white cells. The interesting part starts when we let the ant go on with its walk. At iterations 96 and 184, rotational symmetry of order 2 is observed; at iteration 368 (Figure 1b), it is almost of order 4. When one could expect further symmetrical patterns, the symmetry breaks down, and after the step 500, the ant seems to walk at random, for more than 9000 iterations (Figure 1c). Again, when one would expect this chaos to go on forever, the ant suddenly starts building a pattern that is periodic but for a drift; it is the so called “highway,” and in the absence of obstacles, the ant will draw it forever (Figure 1d). This brief history involving a break of symmetry, a “chaotic” phase, and sudden order, all generated by a rule that could hardly be simpler, becomes more intriguing when we notice that it repeats with other initial patterns. In fact, the highway has appeared, sooner or later, in all the simulations that have been started with a finite amount of black (or of white) cells (we call them configurations with finite support). Nobody has demonstrated Langton’s ant, with its intriguing behavior, has been elusive to theoretical results, particularly from the point of view of the system’s complexity. We summarize here some recent work of our group, that sheds some new light on the ant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Langton's Ant: Dynamical Behavior and Complexity

Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between characteristics of finite graphs and the dynamics of the ant on them. Then we consider the infinite bi-regular graphs of degrees 3 and 4, where we prove the universality of the system, and in the particular cases of the ...

متن کامل

From Complexity to Random Behaviors; Generate Random Numbers by Confusion in Cellular Automata State’s

Cellular Automata(CA) with evolutionary and complex behaviors are used in several applications such as generating random numbers and cryptography. Because of the intrinsic self-organizing property, pure CA cannot produce a long sequence of random numbers. For increasing the sequence of produced numbers, nonuniform CA, controllable/programmable CA, stimulating factors or combination of several a...

متن کامل

Complexity of Langton's ant

The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with the trajectory of a single ant. This proves the P-hardness of the system and implies, through the simulation of one-dimensional cellular automata and Turing machines, the universality of the ant...

متن کامل

Kolmogorov complexity and cellular automata classification

We present a new approach to cellular automata (CA for short) classification based on algorithmic complexity. We construct a parameter κ which is based only on the transition table of CA and measures the “randomness” of evolutions; κ is better, in a certain sense, than any other parameter recursively definable on CA tables. We investigate the relations between the classical topological approach...

متن کامل

Compression Depth and the Behavior of Cellular Automata 1

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure , which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classiication sche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Complexity

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2001